Upward Topological Analysis of Large Circuits Using Directed Graph Representation
نویسندگان
چکیده
Absrruct-This paper presents the method of topological analysis of large LLS networks with the use of hierarchical decomposition of the network graph. It is assumed that the network is represented by a directed wvh. An algorithm of upward hierarchical analysis of a partitioned graph is (a) (b) presented. The algorithm allows symbolic analysis of large networks with Fig. 1. Graph G and its trisection (a) and substitute graph of decomposition the number of elements kept as symbols practically unlimited. The compuG” (b). tational time linearly depends on the network size. A computer program using techniques described is also presented.
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملUpward Topological Book Embeddings of DAGs
Let G be a directed acyclic graph. An upward (k, h)topological book embedding of G is an upward book embedding on k pages of a subdivision of G where every edge is replaced by a path having at most h+2 vertices. In this extended abstract it is shown that every DAG with n vertices admits an upward (d + 1, 2dlogd ne − 1)-topological book embedding, where d is any integer such that d ≥ 2. The resu...
متن کاملAnalysis of the enzyme network involved in cattle milk production using graph theory
Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle...
متن کاملEFFICIENT DESIGN OF EMBEDDED SIGNAL PROCESSING SYSTEMS USING TOPOLOGICAL PATTERNS BASED DATAFLOW GRAPH REPRESENTATIONS by
Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-sc...
متن کامل